Bifactor approximation for location routing with vehicle and facility capacities

An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem

We consider the metric uncapacitated facility location problem(UFL). In this paper we modify the (1+2=e)-approximation algorithm of Chudak and Shmoys to obtain a new (1.6774,1.3738)approximation algorithm for the UFL problem. Our linear programing rounding algorithm is the rst one that touches the approximability limit curve ( f ; 1 + 2e f ) established by Jain et al. As a consequence, we obtai...

Dynamic Facility Location with Generalized Modular Capacities

Location decisions are frequently subject to dynamic aspects such as changes in customer demand. Often, flexibility regarding the geographic location of facilities, as well as their capacities, is the only solution to such issues. Even when demand can be forecast, finding the optimal schedule for the deployment and dynamic adjustment of capacities remains a challenge, especially when the cost s...

Facility Location with Nonuniform Hard Capacities

In this paper we give the first constant factor approximation algorithm for the Facility Location Problem with nonuniform, hard capacities. Facility location problems have received a great deal of attention in recent years. Approximation algorithms have been developed for many variants. Most of these algorithms are based on linear programming, but the LP techniques developed thus far have been ...

Local improvement in planar facility location using vehicle routing

Optimal Capacities in Discrete Facility Location Design Problem

Network location models comprise one of the main categories of location models. These models have various applications in regional and urban planning as well as in transportation, distribution, and energy management. In a network location problem, nodes represent demand points and candidate locations to locate the facilities. If the links network is unchangeably determined, the problem will be ...